The Weak Series Reduction Property Implies Pseudomodularity

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The disjunction property implies the numerical existence property.

Any recursively enumerable extension of intuitionistic arithmetic which obeys the disjunction property obeys the numerical existence property. Any recursively enumerable extension of intuitionistic arithmetic proves its own disjunction property if and only if it proves its own inconsistency.

متن کامل

THE WEAK-A∞ PROPERTY OF HARMONIC AND p-HARMONIC MEASURES IMPLIES UNIFORM RECTIFIABILITY

Let E ⊂ Rn+1, n ≥ 2, be an Ahlfors-David regular set of dimension n. We show that the weak-A∞ property of harmonic measure, for the open set Ω := Rn+1 \ E, implies uniform rectifiability of E. More generally, we establish a similar result for the Riesz measure, p-harmonic measure, associated to the p-Laplace operator, 1 < p < ∞.

متن کامل

Weak Banach-Saks property in the space of compact operators

For suitable Banach spaces $X$ and $Y$ with Schauder decompositions and‎ ‎a suitable closed subspace $mathcal{M}$ of some compact operator space from $X$ to $Y$‎, ‎it is shown that the strong Banach-Saks-ness of all evaluation‎ ‎operators on ${mathcal M}$ is a sufficient condition for the weak‎ ‎Banach-Saks property of ${mathcal M}$, where for each $xin X$ and $y^*in‎ ‎Y^*$‎, ‎the evaluation op...

متن کامل

The Weak Repulsion Property

In 1926 M. Lavrentiev [7] proposed an example of a variational problem whose infimum over the Sobolev spaceW, for some values of p ≥ 1, is strictly lower than the infimum overW1,∞. This energy gap is known since then as the Lavrentiev phenomenon. The aim of this paper is to provide a deeper insight into this phenomenon by shedding light on an unnoticed feature. Any energy that presents the Lavr...

متن کامل

Restricted Strong Convexity Implies Weak Submodularity

We connect high-dimensional subset selection and submodular maximization. Our results extend the work of Das and Kempe (2011) from the setting of linear regression to arbitrary objective functions. For greedy feature selection, this connection allows us to obtain strong multiplicative performance bounds on several methods without statistical modeling assumptions. We also derive recovery guarant...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Combinatorics

سال: 1997

ISSN: 0195-6698

DOI: 10.1006/eujc.1996.0117